A proof of the crossing number of K3, n in a surface
نویسنده
چکیده
In this note we give a simple proof of a result of Richter and Siran by basic counting method, which says that the crossing number of K3,n in a surface with Euler genus ε is
منابع مشابه
Development of a DNA Aptamer for Screening Neisseria meningitidis Serogroup B by Cell SELEX
Background: Artificial oligonucleotides like DNA or RNA aptamers can be used as biodiagnostic alternatives for antibodies to detect pathogens. Comparing to antibodies, artificial oligonucleotides are produced easily at lower costs and are more stable. Neisseria meningitidis, the causative agent of meningitis, is responsible for about 1% of infections in an epidemic period. Specific DNA aptamers...
متن کاملNumerical study of heat gradient and crossing energy to around building walls containing phase change materials in Kashan temperature conditions
The application of phase change materials (PCM) in the variant parts of building because of the high capacity these materials, lead to an improvement in temperature conditions and reduction in energy consumption. Due to the high dependency of the performance of these materials to the ambient temperature fluctuations, their applications in climates with extreme temperature fluctuations has a sig...
متن کاملEffects of Vitamin K3 on Cytotoxicity and DNA-binding Properties of a Palladium(II) Complex as a Potential Antitumor Agent
In many diseases such as cancer, simultaneous use of two or more pharmacologically active agents will be more effective and have fewer side effects. In this study a new palladium(II) complex with formula of [Pd(phen)(py-dtc)]NO3 (where is phen 1,10-phenanthroline and py-dtc is n-propyldithiocarbamate), was synthesized. The cytotoxic activity of this complex was tested against leukemia K562 cell...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 27 شماره
صفحات -
تاریخ انتشار 1996